A Computational Information Criterion for Particle-Tracking with Sparse or Noisy Data
نویسندگان
چکیده
Abstract Traditional probabilistic methods for the simulation of advection-diffusion equations (ADEs) often overlook entropic contribution discretization, e.g., number particles, within associated numerical methods. Many times, gain in accuracy a highly discretized model is outweighed by its computational costs or noise data. We address question how many particles are needed to best approximate and estimate parameters one-dimensional advective-diffusive transport. To do so, we use well-known Akaike Information Criterion (AIC) recently-developed correction called Computational (COMIC) guide selection process. Random-walk mass-transfer particle tracking employed solve at various levels discretization. Numerical results demonstrate that COMIC provides an optimal can describe more efficient terms parameter estimation prediction compared selected AIC even when data sparse noisy, sampling volume not uniform throughout physical domain, error distribution non-IID Gaussian.
منابع مشابه
Voronoi tracking: location estimation using sparse and noisy sensor data
Tracking the activity of people in indoor environments has gained considerable attention in the robotics community over the last years. Most of the existing approaches are based on sensors which allow to accurately determine the locations of people but do not provide means to distinguish between different persons. In this paper we propose a novel approach to tracking moving objects and their id...
متن کاملA Method for Establishing a Support Criterion or Poverty Line
In this paper, a method for establishing a support criterion or poverty line is developed based on Engel’s Law and domestic nutritional values. The support criterion is differentiated across rural and urban areas. An important result is that for 1989, people who spend less than 108,000 Rials annually lie inside the poverty line in urban areas. A further important result is that food should be g...
متن کاملSubspace Information Criterion for Sparse Regressors
Non-quadratic regularizers, in particular the ` 1 norm regularizer can yield sparse solutions that generalize well. In this work we propose the Generalized Subspace Information Criterion (GSIC) that allows to predict the generalization error for this useful family of regularizers. We show that under some technical assumptions GSIC is an asymptotically unbiased estimator of the generalization er...
متن کاملA New Modified Particle Filter With Application in Target Tracking
The particle filter (PF) is a novel technique that has sufficiently good estimation results for the nonlinear/non-Gaussian systems. However, PF is inconsistent that caused mainly by loss of particle diversity in resampling step and unknown a priori knowledge of the noise statistics. This paper introduces a new modified particle filter called adaptive unscented particle filter (AUPF) to overcome th...
متن کاملMinimax Bounds for Sparse Pca with Noisy High-dimensional Data.
We study the problem of estimating the leading eigenvectors of a high-dimensional population covariance matrix based on independent Gaussian observations. We establish a lower bound on the minimax risk of estimators under the l2 loss, in the joint limit as dimension and sample size increase to infinity, under various models of sparsity for the population eigenvectors. The lower bound on the ris...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Water Resources
سال: 2021
ISSN: ['1872-9657', '0309-1708']
DOI: https://doi.org/10.1016/j.advwatres.2021.103893